A Representative Set Method for Symbolic Sequence Clustering
نویسندگان
چکیده
منابع مشابه
A Hybrid Method for Sequence Clustering
The problem of sequence clustering is one of the fundamental research topics. However, most algorithms are dedicated to the case of single-label clustering. In this paper, we propose sequence clustering algorithms which can be applied for finding multi labels with respect to variable-length sequences. In our research, we first map sequences as vectors in the feature space by applying DCT transf...
متن کاملA New Symbolic Method for Discernibility Matrix in Rough Set
Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Zero-Suppressed BDDs (ZBDD) and Ordered binary decision diagrams (OBDD) is proposed in this paper, experim...
متن کاملCrossed Clustering method on Symbolic Data tables
In this paper we propose a crossed clustering algorithm in order to partition a set of symbolic objects in a predefined number of classes and to determine, in the same time, a structure (taxonomy) on the categories of the object descriptors. The procedure is an extension of the classical simultaneous clustering algorithms proposed on binary and contingency tables. Our approach is based on a dyn...
متن کاملA BINARY LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION
This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jac...
متن کاملRepresentative Proteomes: A Stable, Scalable and Unbiased Proteome Set for Sequence Analysis and Functional Annotation
The accelerating growth in the number of protein sequences taxes both the computational and manual resources needed to analyze them. One approach to dealing with this problem is to minimize the number of proteins subjected to such analysis in a way that minimizes loss of information. To this end we have developed a set of Representative Proteomes (RPs), each selected from a Representative Prote...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Science and Technology
سال: 2013
ISSN: 1505-0602
DOI: 10.12921/cmst.2013.19.02.99-105